Existence Condition for the Diffusion Approximations of Multiclass Priority Queueing Networks
نویسندگان
چکیده
In this paper, we extend the work of Chen and Zhang (2000b) and establish a new sufficient condition for the existence of the (conventional) diffusion approximation for multiclass queueing networks under priority service disciplines. This sufficient condition relates to the weak stability of the fluid networks and the stability of the high priority classes of the fluid networks that correspond to the queueing networks under consideration. Using this sufficient condition, we prove the existence of the diffusion approximation for the last-bufferfirst-served reentrant lines. We also study a three-station network example, and observe that the diffusion approximation may not exist, even if the “proposed” limiting semimartingale reflected Brownian motion (SRBM) exists.
منابع مشابه
Stability of Multiclass Queueing Networks Under Priority Service Disciplines
In this paper, we establish a suucient condition for the stability of a multiclass uid network and queueing network under priority service disciplines. The suucient condition is based on the existence of a linear Lyapunov function, and it is stated in terms of the feasibility of a set of inequalities that are deened by network parameters. In all the networks we have tested, this suucient condit...
متن کاملValidity of Heavy-Traffic Steady-State Approximations in Multiclass Queueing Networks: The Case of Queue-Ratio Disciplines
A class of stochastic processes known as semi-martingale reflecting Brownian motions (SRBMs) is often used to approximate the dynamics of heavily loaded queueing networks. In two influential papers, Bramson (1998) and Williams (1998) laid out a general and structured approach for proving the validity of such heavy-traffic approximations, in which an SRBM is obtained as a diffusion limit from a ...
متن کاملA new framework supporting the bottleneck analysis of multiclass queueing networks
In this paper, we introduce a new framework supporting the bottleneck analysis of closed, multiclass BCMP queueing networks with large population sizes. First, we provide a sufficient and necessary condition establishing the existence of a single bottleneck. Then, we derive the new framework proposing efficient algorithms for the identification of queueing networks bottlenecks by means of linea...
متن کاملSample Path Large Deviations for Multiclass Feedforward Queueing Networks in Critical Loading
We consider multiclass feedforward queueing networks with first in first out and priority service disciplines at the nodes, and class dependent deterministic routing between nodes. The random behavior of the network is constructed from cumulative arrival and service time processes which are assumed to satisfy an appropriate sample path large deviation principle. We establish logarithmic asympto...
متن کاملDiffusion Approximations for a Multiclass Markovian Service System with "Guaranteed" and "Best-Effort" Service Levels
This paper considers a Markovian model of a service system motivated by communication and information services. The system has finite processing capacity and offers multiple grades of service. The highest priority users receive a “guaranteed” processing rate, while lower priority users share residual capacity according to their priority level and therefore may experience service degradation (he...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Queueing Syst.
دوره 38 شماره
صفحات -
تاریخ انتشار 2001